A topology construction from line drawings using a uniform plane subdivision technique
Identifieur interne : 002013 ( Main/Exploration ); précédent : 002012; suivant : 002014A topology construction from line drawings using a uniform plane subdivision technique
Auteurs : B. Žalik [Slovénie]Source :
- Computer-Aided Design [ 0010-4485 ] ; 1999.
English descriptors
Abstract
The paper describes an algorithm for constructing the topology from a set of line segments or polylines. The problem appears for example at land-maps that have been drawn by general-purpose drawing packages or captured from blue-prints by digitalisation. The solution comprises two steps; in the first step inconsistencies in the input data are detected and removed, and in the second step the topology is constructed. The algorithm for topology construction consists of two phases: determination of a concave hull, and generation of polygons. It is shown that the running-time of the presented algorithm is better than O(n2), where n is the number of input points. Because of a large number of geometric elements being expected, the geometric search needed at the first step of the algorithm is speeded up by an acceleration technique—a uniform plane subdivision.
Url:
DOI: 10.1016/S0010-4485(99)00034-2
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F64
- to stream Istex, to step Curation: 000F17
- to stream Istex, to step Checkpoint: 001564
- to stream Main, to step Merge: 002122
- to stream Main, to step Curation: 002013
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A topology construction from line drawings using a uniform plane subdivision technique</title>
<author><name sortKey="Zalik, B" sort="Zalik, B" uniqKey="Zalik B" first="B." last="Žalik">B. Žalik</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:E7B0DF566620794DF5D3B37ECF2FD67ACB802C95</idno>
<date when="1999" year="1999">1999</date>
<idno type="doi">10.1016/S0010-4485(99)00034-2</idno>
<idno type="url">https://api.istex.fr/document/E7B0DF566620794DF5D3B37ECF2FD67ACB802C95/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000F64</idno>
<idno type="wicri:Area/Istex/Curation">000F17</idno>
<idno type="wicri:Area/Istex/Checkpoint">001564</idno>
<idno type="wicri:doubleKey">0010-4485:1999:Zalik B:a:topology:construction</idno>
<idno type="wicri:Area/Main/Merge">002122</idno>
<idno type="wicri:Area/Main/Curation">002013</idno>
<idno type="wicri:Area/Main/Exploration">002013</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A topology construction from line drawings using a uniform plane subdivision technique</title>
<author><name sortKey="Zalik, B" sort="Zalik, B" uniqKey="Zalik B" first="B." last="Žalik">B. Žalik</name>
<affiliation wicri:level="1"><country xml:lang="fr">Slovénie</country>
<wicri:regionArea>Faculty of Electrical Engineering and Computer Sciences, University of Maribor, Smetanova 17, SI-2000 Maribor</wicri:regionArea>
<wicri:noRegion>SI-2000 Maribor</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Slovénie</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Computer-Aided Design</title>
<title level="j" type="abbrev">JCAD</title>
<idno type="ISSN">0010-4485</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="1999">1999</date>
<biblScope unit="volume">31</biblScope>
<biblScope unit="issue">5</biblScope>
<biblScope unit="page" from="335">335</biblScope>
<biblScope unit="page" to="348">348</biblScope>
</imprint>
<idno type="ISSN">0010-4485</idno>
</series>
<idno type="istex">E7B0DF566620794DF5D3B37ECF2FD67ACB802C95</idno>
<idno type="DOI">10.1016/S0010-4485(99)00034-2</idno>
<idno type="PII">S0010-4485(99)00034-2</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0010-4485</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational geometry</term>
<term>Topology construction</term>
<term>Uniform space subdivision</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The paper describes an algorithm for constructing the topology from a set of line segments or polylines. The problem appears for example at land-maps that have been drawn by general-purpose drawing packages or captured from blue-prints by digitalisation. The solution comprises two steps; in the first step inconsistencies in the input data are detected and removed, and in the second step the topology is constructed. The algorithm for topology construction consists of two phases: determination of a concave hull, and generation of polygons. It is shown that the running-time of the presented algorithm is better than O(n2), where n is the number of input points. Because of a large number of geometric elements being expected, the geometric search needed at the first step of the algorithm is speeded up by an acceleration technique—a uniform plane subdivision.</div>
</front>
</TEI>
<affiliations><list><country><li>Slovénie</li>
</country>
</list>
<tree><country name="Slovénie"><noRegion><name sortKey="Zalik, B" sort="Zalik, B" uniqKey="Zalik B" first="B." last="Žalik">B. Žalik</name>
</noRegion>
<name sortKey="Zalik, B" sort="Zalik, B" uniqKey="Zalik B" first="B." last="Žalik">B. Žalik</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002013 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002013 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:E7B0DF566620794DF5D3B37ECF2FD67ACB802C95 |texte= A topology construction from line drawings using a uniform plane subdivision technique }}
This area was generated with Dilib version V0.6.32. |